Facet browsing currently unavailable
Page 1 of 296 results
Sort by: relevance publication year
A polynomial rule for the problem of sharing delay costs in PERT networks JOURNAL ARTICLE published July 2008 in Computers & Operations Research |
Optimised synthesis of delay-insensitive circuits using time-sharing JOURNAL ARTICLE published 1994 in IEE Proceedings - Computers and Digital Techniques |
Polynomial calculation of the Shapley value based on sampling JOURNAL ARTICLE published May 2009 in Computers & Operations Research |
Preventing tree saturation in multistage networks JOURNAL ARTICLE published 1994 in IEE Proceedings - Computers and Digital Techniques |
Corrigendum to “Combinatorial Benders decomposition for the operational aircraft maintenance routing problem” [Comput. Oper. Res. 164 (2024) 106545] JOURNAL ARTICLE published July 2024 in Computers & Operations Research |
Polynomial time algorithms for the UET permutation flowshop problem with time delays JOURNAL ARTICLE published February 2008 in Computers & Operations Research |
Improving polynomial estimation of the Shapley value by stratified random sampling with optimum allocation JOURNAL ARTICLE published June 2017 in Computers & Operations Research |
Application of aggregation strategies in the solution of the optimal routing problem in data networks JOURNAL ARTICLE published 1996 in IEE Proceedings - Computers and Digital Techniques |
Efficient sharing (broadcasting) of multiple secrets JOURNAL ARTICLE published 1995 in IEE Proceedings - Computers and Digital Techniques |
An Enhanced Approximation by Pair-Wise Analysis of Servers for Time Delay Distributions in Queueing Networks JOURNAL ARTICLE published January 1986 in IEEE Transactions on Computers |
Erratum to “Benders decomposition for a period-aggregated resource leveling problem with variable job duration” [Comput. Oper. Res. 132 (2021) 105258] JOURNAL ARTICLE published September 2022 in Computers & Operations Research |
Corrigendum to “Hybrid metaheuristics for the clustered vehicle routing problem [Comput. Oper. Res., 58 (2015): 87–99]” JOURNAL ARTICLE published September 2017 in Computers & Operations Research |
Sensitivity analysis of the knapsack sharing problem: Perturbation of the weight of an item JOURNAL ARTICLE published January 2008 in Computers & Operations Research |
Ciphering algorithms in MicroBlaze-based embedded systems JOURNAL ARTICLE published 2006 in IEE Proceedings - Computers and Digital Techniques |
A Solution to the Polynomial Hensel Code Conversion Problem JOURNAL ARTICLE published May 1987 in IEEE Transactions on Computers |
Logic simulation methods for longest path delay estimation JOURNAL ARTICLE published 2002 in IEE Proceedings - Computers and Digital Techniques |
V-fairness (t, n) secret sharing scheme JOURNAL ARTICLE published 1997 in IEE Proceedings - Computers and Digital Techniques |
R70-37 Extensions of Asynchronous Circuits and the Delay Problem I. Good Extensions and the Delay Problem of the First Kind JOURNAL ARTICLE published September 1970 in IEEE Transactions on Computers |
Low-power bus encoding with crosstalk delay elimination JOURNAL ARTICLE published 2006 in IEE Proceedings - Computers and Digital Techniques |
Identification of T-codes with minimal average synchronisation delay JOURNAL ARTICLE published 2000 in IEE Proceedings - Computers and Digital Techniques |